Decoding by Sampling: A Randomized Lattice Algorithm for Bounded Distance Decoding
نویسندگان
چکیده
منابع مشابه
Reduced Complexity Bounded .Distance Decoding of the Leech Lattice
A bstmct-A new efficient algorithm for bounded-distance decoding of the Leech la t t ice is presented. The algori thm decodes correctly at least ulp to the guaranteed error-correction radius of the Leech lattice. The proposed decoder is based on projecting the points of the Leech lattice onto the codewords of the (6,3,4) quar te rnary code, the hezacode Ne. Project ion on the hexacode induces p...
متن کاملAn Efficient Best-First Derandomization Sampling Algorithm for Lattice Decoding
Although lattice reduction aided decoding improves the decoding performance, it has a performance gap to Maximum Likelihood (ML) decoding increasing with the lattice dimension. In view of this, efficient suboptimal decoding algorithms that can narrow the gap are desirable. In this paper, an efficient Best-First Derandomized Sampling (BFDS) decoding algorithm is proposed to achieve near optimal ...
متن کاملOn Bounded Distance Decoding for General Lattices
A central problem in the algorithmic study of lattices is the closest vector problem: given a lattice L represented by some basis, and a target point y, nd the lattice point closest to y. Bounded Distance Decoding is a variant of this problem in which the target is guaranteed to be close to the lattice, relative to the minimum distance 1(L) of the lattice. Speci cally, in the -Bounded Distance ...
متن کاملLattice Decoding for Joint
A new joint detection method based on sphere packing lattice decoding is presented. The algorithm is suitable for both synchronous and asynchronous multiple access CDMA-DSSS systems, and it may jointly detect up to 32 users with a reasonable complexity. The detection complexity is independent of the modulation size and large M-PAM or M-QAM constellations can be used. Further, a theoretical gain...
متن کاملA Simple Direction-Based Lattice Decoding Algorithm for Golden Codes
A quadrant localized lattice decoding algorithm for the golden codes is proposed in this paper that requires very low computational complexity as compared to the sphere decoder. The proposed algorithm is mainly based on the idea of utilizing its directional attributes and localizing the search in a single quadrant of the multi-dimensional space in which the received point lies. We specifically ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2011
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2011.2162180